Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
نویسندگان
چکیده
منابع مشابه
Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
Estimation of multiple directed graphs becomes challenging in the presence of inhomogeneous data, where directed acyclic graphs (DAGs) are used to represent causal relations among random variables. To infer causal relations among variables, we estimate multiple DAGs given a known ordering in Gaussian graphical models. In particular, we propose a constrained maximum likelihood method with noncon...
متن کاملPersistent Homology Over Directed Acyclic Graphs
We define persistent homology groups over any set of spaces which have inclusions defined so that the underlying graph between the spaces is directed and acyclic. This method simultaneously generalizes standard persistent homology, zigzag persistence and multidimensional persistence to arbitrary directed acyclic graphs, and it also allows the study of arbitrary families of topological spaces or...
متن کاملExact estimation of multiple directed acyclic graphs
Abstract. This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the vertices in each DAG share a common ordering. Furthermore, we allow al...
متن کاملMaximum likelihood fitting of acyclic directed mixed graphs to binary data
Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation.
متن کاملPenalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs.
Directed acyclic graphs are commonly used to represent causal relationships among random variables in graphical models. Applications of these models arise in the study of physical and biological systems where directed edges between nodes represent the influence of components of the system on each other. Estimation of directed graphs from observational data is computationally NP-hard. In additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Analysis and Data Mining
سال: 2012
ISSN: 1932-1864
DOI: 10.1002/sam.11168